Computability of Julia Sets
نویسندگان
چکیده
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
منابع مشابه
On Computability of Julia Sets: Answers to Questions of Milnor and Shub
In this note we give answers to questions posed to us by J. Milnor and M. Shub, which shed further light on the structure of non-computable Julia sets.
متن کاملComputational Complexity of Euclidean Sets : Hyperbolic Julia Sets are Poly - Time Computable
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman Master of Science Graduate Department of Computer Science University of Toronto 2004 We investigate different definitions of the computability and complexity of sets in R, and establish new connections between these definitions. This allows us to connect the computability of real functions ...
متن کاملComputability and Complexity of Julia Sets (Invited Talk)
Studying dynamical systems is key to understanding a wide range of phenomena ranging from planetary movement to climate patterns to market dynamics. Various numerical tools have been developed to address specific questions about dynamical systems, such as predicting the weather or planning the trajectory of a satellite. However, the theory of computation behind these problems appears to be very...
متن کاملNon-computable Julia sets
Polynomial Julia sets have emerged as the most studied examples of fractal sets generated by a dynamical system. Apart from the beautiful mathematics, one of the reasons for their popularity is the beauty of the computer-generated images of such sets. The algorithms used to draw these pictures vary; the most näıve work by iterating the center of a pixel to determine if it lies in the Julia set....
متن کاملHyperbolic Julia Sets are Poly-Time Computable
In this paper we prove that hyperbolic Julia sets are locally computable in polynomial time. Namely, for each complex hyperbolic polynomial p(z), there is a Turing machine Mp(z) that can “draw” the set with the precision 2 −n, such that it takes time polynomial in n to decide whether to draw each pixel. In formal terms, it takes time polynomial in n to decide for a point x whether d(x, Jp(z)) <...
متن کامل